n = int(input())
a = 1
for i in range(n,n//2 ,-1):
a = a*i
b = 1
for i in range(1,n//2+1):
b = b*i
c = b//(n//2)
ans = ((a//b)//2)*c*c
print(ans)#include <bits/stdc++.h>
using namespace std;
int MOD = 1e9 + 7;
long long fn(long long n) {
if (n == 1) return 1;
return n * fn(n - 1);
}
int main() {
int n;
cin >> n;
cout << fn(n - 1) / (n / 2);
return 0;
}
222. Count Complete Tree Nodes | 215. Kth Largest Element in an Array |
198. House Robber | 153. Find Minimum in Rotated Sorted Array |
150. Evaluate Reverse Polish Notation | 144. Binary Tree Preorder Traversal |
137. Single Number II | 130. Surrounded Regions |
129. Sum Root to Leaf Numbers | 120. Triangle |
102. Binary Tree Level Order Traversal | 96. Unique Binary Search Trees |
75. Sort Colors | 74. Search a 2D Matrix |
71. Simplify Path | 62. Unique Paths |
50. Pow(x, n) | 43. Multiply Strings |
34. Find First and Last Position of Element in Sorted Array | 33. Search in Rotated Sorted Array |
17. Letter Combinations of a Phone Number | 5. Longest Palindromic Substring |
3. Longest Substring Without Repeating Characters | 1312. Minimum Insertion Steps to Make a String Palindrome |
1092. Shortest Common Supersequence | 1044. Longest Duplicate Substring |
1032. Stream of Characters | 987. Vertical Order Traversal of a Binary Tree |
952. Largest Component Size by Common Factor | 212. Word Search II |